Connections in Networks: Hardness of Feasibility Versus Optimality
نویسندگان
چکیده
We study the complexity of combinatorial problems that consist of competing infeasibility and optimization components. In particular, we investigate the complexity of the connection subgraph problem, which occurs, e.g., in resource environment economics and social networks. We present results on its worst-case hardness and approximability. We then provide a typical-case analysis by means of a detailed computational study. First, we identify an easy-hard-easy pattern, coinciding with the feasibility phase transition of the problem. Second, our experimental results reveal an interesting interplay between feasibility and optimization. They surprisingly show that proving optimality of the solution of the feasible instances can be substantially easier than proving infeasibility of the infeasible instances in a computationally hard region of the problem space. We also observe an intriguing easy-hard-easy profile for the optimization component itself.
منابع مشابه
Role of STDP in regulation of neural timing networks in human: a simulation study
Many physiological events require an accurate timing signal, usually generated by neural networks called central pattern generators (CPGs). On the other hand, properties of neurons and neural networks (e.g. time constants of neurons and weights of network connections) alter with time, resulting in gradual changes in timing of such networks. Recently, a synaptic weight adjustment mechanism has b...
متن کاملRole of STDP in regulation of neural timing networks in human: a simulation study
Many physiological events require an accurate timing signal, usually generated by neural networks called central pattern generators (CPGs). On the other hand, properties of neurons and neural networks (e.g. time constants of neurons and weights of network connections) alter with time, resulting in gradual changes in timing of such networks. Recently, a synaptic weight adjustment mechanism has b...
متن کاملIntrusion Detection in IOT based Networks Using Double Discriminant Analysis
Intrusion detection is one of the main challenges in wireless systems especially in Internet of things (IOT) based networks. There are various attack types such as probe, denial of service, remote to local and user to root. In addition to known attacks and malicious behaviors, there are various unknown attacks that some of them have similar behavior with respect to each other or mimic the norma...
متن کاملFEASIBILITY OF PRODUCING NANO STRUCTURED METALLIC AND NON-METALLIC COATINGS ON Al SUBSTRATE USING MECHANICAL COATING ROUTE
In this paper, the possibility of mechanical coating of aluminum with either Ni or SiC using planetary ball mill was studied. The Al substrate was fixed inside of the vial lid of a planetary ball mill filled with milling balls and starting powder. The phase analysis and crystallite size measurement of the coatings were carried out using X-ray diffraction (XRD) method. Scanning electron micro...
متن کاملStability and Pareto optimality in Refugee Allocation Matchings
We focus on the refugee matching problem—a general “twosided matching under preferences” model with multi-dimensional feasibility constraints that was formalized by Delacretaz, Kominers, and Teytelboym (2016). We propose a taxonomy of stability concepts for the refugee matching problem; identify relations between them; and show that even for two natural weakenings of the standard stability conc...
متن کامل